نتایج جستجو برای: factorization structure
تعداد نتایج: 1586623 فیلتر نتایج به سال:
In this article the notions of semi weak orthogonality and semi weak factorization structure in a category $mathcal X$ are introduced. Then the relationship between semi weak factorization structures and quasi right (left) and weak factorization structures is given. The main result is a characterization of semi weak orthogonality, factorization of morphisms, and semi weak factorization structur...
we prove that the class of profinite groups $g$ that have a factorization $g=ab$ with $a$ and $b$ abelian closed subgroups, is closed under taking strict projective limits. this is a generalization of a recent result by k.h.~hofmann and f.g.~russo. as an application we reprove their generalization of iwasawa's structure theorem for quasihamiltonian pro-$p$ groups.
The textit{QIF} (Quadrant Interlocking Factorization) method of Evans and Hatzopoulos solves linear equation systems using textit{WZ} factorization. The WZ factorization can be faster than the textit{LU} factorization because, it performs the simultaneous evaluation of two columns or two rows. Here, we present a method for computing the real and integer textit{WZ} and textit{ZW} factoriz...
we prove that the class of profinite groups $g$ that have a factorization $g=ab$ with $a$ and $b$ abelian closed subgroups, is closed under taking inverse limits of surjective inverse systems. this is a generalization of a recent result by k. h. hofmann and f. g. russo. as an application we reprove their generalization of iwasawa's structure theorem for quasihamiltonian pro-$p$...
classes of abaffy-broyden-spedicato (abs) methods have been introduced for solving linear systems of equations. the algorithms are powerful methods for developing matrix factorizations and many fundamental numerical linear algebra processes. here, we show how to apply the abs algorithms to devise algorithms to compute the wz and zw factorizations of a nonsingular matrix as well as...
classes of abaffy-broyden-spedicato (abs) methods have been introduced for solving linear systems of equations. the algorithms are powerful methods for developing matrix factorizations and many fundamental numerical linear algebra processes. here, we show how to apply the abs algorithms to devise algorithms to compute the wz and zw factorizations of a nonsingular matrix as well as...
Introduction Suppose that is a commutative ring with identity, is a unitary -module and is a multiplicatively closed subset of . Factorization theory in commutative rings, which has a long history, still gets the attention of many researchers. Although at first, the focus of this theory was factorization properties of elements in integral domains, in the late nineties the theory was gener...
1 Structure Sheaves 7 1.1 C-Valued Sheaves . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 1.2 Geometries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 1.3 Factorization Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22 1.4 The Factorization System on StrG(X) . . . ....
Lyndon factorization and Lempel-Ziv (LZ) factorization are both important tools for analysing the structure and complexity of strings, but their combinatorial structure is very different. In this paper, we establish the first direct connection between the two by showing that while the Lyndon factorization can be bigger than the non-overlapping LZ factorization (which we demonstrate by describin...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید